Art gallery theorems for guarded guards

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Art gallery theorems for guarded guards

We prove two art gallery theorems in which the guards must guard one another in addition to the gallery. A set G of points (the guards) in a simple closed polygon (the art gallery) is a guarded guard set provided (i) every point in the polygon is visible to some point in G; and (ii) every point in G is visible to some other point in G. We prove that a polygon with n sides always has a guarded g...

متن کامل

Special Guards in Chromatic Art Gallery

We present two new versions of the chromatic art gallery problem that can improve upper bound of the required colors pretty well. In our version, we employ restricted angle guards so that these modern guards can visit α-degree of their surroundings. If α is between 0 and 180 degree, we demonstrate that the strong chromatic guarding number is constant. Then we use orthogonal 90-degree guards for...

متن کامل

Norman Do Art Gallery Theorems

Imagine that you are the owner of several art galleries and that you are in the process of hiring people to guard one of them. Unfortunately, with so many in your possession, you seem to have forgotten the exact shape of this particular one. In fact, all you can remember is that the art gallery is a polygon with n sides. Of course, guards have the capacity to turn around a full 360◦ and can see...

متن کامل

The Orthogonal Art Gallery Theorem with Constrained Guards

Let P be an orthogonal polygon with n vertices, and let V ∗ and E∗ be specified sets of vertices and edges of P . We prove that P has a guard set of cardinality at most ⌊(n+ 3|V ∗|+ 2|E∗|) /4⌋ that includes each vertex in V ∗ and at least one point of each edge in E∗. Our bound is sharp and reduces to the orthogonal art gallery theorem of Kahn, Klawe and Kleitman when V ∗ and E∗ are empty.

متن کامل

Art Gallery Theorems and Approximation Algorithms

The art gallery problem is to determine the number of guards that are sufficient to cover or see every point in the interior of an art gallery. An art gallery can be viewed as a polygon P with or without holes with a total of n vertices and guards as points in P . Any point z ∈ P is said to be visible from a guard g if the line segment joining z and g does not intersect the exterior of P . Usua...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Geometry

سال: 2003

ISSN: 0925-7721

DOI: 10.1016/s0925-7721(03)00039-7